COMMENT ⊗   VALID 00003 PAGES
C REC  PAGE   DESCRIPTION
C00001 00001
C00002 00002	Problem: reduce the frame problem to the qualification problem
C00003 00003	The general problem solver:
C00004 ENDMK
C⊗;
Problem: reduce the frame problem to the qualification problem
by saying that a thing doesn't change unless something changes it
and express this as an axiom schema.

¬moving(x,s) ∧ ∀z.¬moves(e,z,x,s) ⊃ location(x,result(e,s)) = location(x,s)

This must be combined with a decision of what things to minimize over.

The general problem solver:

	1. finds solutions open sentences expressed in predicate
calculus.

	2. expresses the answers as sentences.

	3. Look into the epistemology of this.  Thus "x solves
cons(e1,e2) = cons(e3,e4) if and only if x solves bothe
e1 = e3 and e2 = e4".

This precedes the heuristic that states "in order to solve
conse(e1,e2) = cons(e3,e4), then solve e1 = e3 subject to
e2 = e4.